Instance Optimal Join Size Estimation

We consider the problem of efficiently estimating size join a collection preprocessed relational tables from perspective instance optimality analysis. The running time optimal algorithms is comparable to minimum needed verify correctness solution. Previously, were only known when was small (as one component their linear in size). give an algorithm for all instances, including large, by removing dependency on size. As byproduct, we show how sample rows uniformly at random amount time.